Evolution in the Orange Box - A New Approach to the Sphere-Packing Problem in CMAC-Based Neural Networks
نویسنده
چکیده
The sphere-packing problem is the task of finding an arrangement to achieve the maximum density of identical spheres in a given space. This problem arises in the placement of kernel functions for uniform input space quantisation in machine learning algorithms. One example is the Cerebellar Model Articulation Controller (CMAC), where the problem arises as the placement of overlapping grids. In such situations, it is desirable to achieve a uniform placement of grid vertices in input space. This is akin to the sphere-packing problem, where the grid vertices are the centres of spheres. The nature of space quantisation inherent in such algorithms imposes constraints on the solution and usually requires a regular tessellation of spheres. The spherepacking problem is difficult to solve analytically, especially with these constraints. The current approach in the case of CMAC-based methods is to rely on published tables of grid spacings, but this has two shortcomings. First, no analytical solution has been published for the calculation of such tables they were arrived at by exhaustive search. Second, the tables include input spaces of only ten dimensions or less. Many data mining problems now rely upon machine learning techniques to solve problems in higher dimensional spaces. A new approach to obtaining suitable grid spacings, based on a Genetic Algorithm, is described, which is potentially faster than exhaustive search. The resulting grid spacings are very similar to the published tables, and empirical trials show that where they differ, the performance on an automated classifier problem is unchanged. The new approach is also feasible for more than ten dimensions, and tables are presented for grid spacings in higher dimensional spaces. The results are applicable to any application where a regular division of input space is required. They allow the investigation of space quantising algorithms for solving problems in high dimensional spaces.
منابع مشابه
A new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملTwo Novel Learning Algorithms for CMAC Neural Network Based on Changeable Learning Rate
Cerebellar Model Articulation Controller Neural Network is a computational model of cerebellum which acts as a lookup table. The advantages of CMAC are fast learning convergence, and capability of mapping nonlinear functions due to its local generalization of weight updating, single structure and easy processing. In the training phase, the disadvantage of some CMAC models is unstable phenomenon...
متن کاملRainfall-runoff modelling using artificial neural networks (ANNs): modelling and understanding
In recent years, artificial neural networks (ANNs) have become one of the most promising tools in order to model complex hydrological processes such as the rainfall-runoff process. In many studies, ANNs have demonstrated superior results compared to alternative methods. ANNs are able to map underlying relationship between input and output data without prior understanding of the process under in...
متن کاملForward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning
The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...
متن کاملA neuro-data envelopment analysis approach for optimization of uncorrelated multiple response problems with smaller the better type controllable factors
In this paper, a new method is proposed to optimize a multi-response optimization problem based on the Taguchi method for the processes where controllable factors are the smaller-the-better (STB)-type variables and the analyzer desires to find an optimal solution with smaller amount of controllable factors. In such processes, the overall output quality of the product should be maximized while t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002